Assignment Exchanges
نویسنده
چکیده
Assignment Exchanges Paul Milgrom September 6, 2008 Abstract. We analyze assignment exchanges –auction and exchange mechanisms which are tight simplifications of direct Walrasian exchange mechanisms. These simplifications are distinguished by their use of “assignment messages,” which parameterize certain substitutable preferences. The “basic” assignment exchanges respect integer constraints, generalizing the Shapley-Shubik mechanism for indivisible goods. Connections are reported between the assignment exchanges, ascending multi-product clock auctions, uniform price auctions for a single product, and Vickrey auctions. The exchange mechanisms accommodate bids by buyers, sellers and swappers and can support trading for certain kinds of complementary goods.
منابع مشابه
The Pollyanna Problem: Assignment of Participants in a Gift Exchange
The assignment problem serves as the basis for a novel formulation and initial approach to assigning participants in holiday " Pollyanna " gift exchanges. This research presents the formalization of a typical heuristic assignment with constraints as commonly imposed by family and work dynamics. The constraints include restrictions on exchanging within the same nuclear family, restrictions on re...
متن کاملA Decomposition Based Approach for Design of Supply Aggregation and Demand Aggregation Exchanges
Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trading with the help of combinatorial bids. The allocation and other associated problems in such exchanges are known to be among the hardest to solve among all economic mechanisms. In this paper, we study combinatorial exchanges where (1) the demand can be aggregated, for example, a procurement exch...
متن کاملA Distributed WDM Routing and Wavelength Assignment Protocol
The main contribution of this work is to propose a distributed on-demand routing and wavelength assignment algorithm for WDM networks. The proposed scheme, termed Distributed Light-path Allocation (DLA), is capable to select routes and establish light-paths via message exchanges without imposing a major overhead on the network. The proposed scheme is able to balance the load in a WDM network. T...
متن کاملEvaluating the Assignment of Behavioral Goals to Coalitions of Agents
We present a formal framework for solving what we call the “assignment problem”: given a set of behavioral goals for a system and a set of agents described by their capabilities to make the system evolve, the problem is to find a “good” assignment of goals to (coalitions of) agents. To do so, we define Kore, a core modelling framework as well as its semantics in terms of a strategy logic called...
متن کاملAas 07-150 a Greedy Random Adaptive Search Procedure for Optimal Scheduling of P2p Satellite Refueling
All studies of peer-to-peer (henceforth abbreviated as P2P) satellite refueling so far assume that all active satellites return back to their original orbital positions after undergoing fuel exchanges with the passive satellites. In this paper, we remove this restriction on the active satellites, namely, we allow the active satellites to interchange orbital slots during the return trips. We for...
متن کامل